Bloom Filter With a False Positive Free Zone

Bloom filters and their variants are widely used as space-efficient probabilistic data structures for representing sets very popular in networking applications. They support fast element insertion deletion, along with membership queries the drawback of false positives. can be designed to match positive rates that acceptable application domain. However, many applications, a common engineering solution is set rate small ignore existence unlikely answers. This article devoted close gap between two design concepts unlikely xmlns:xlink="http://www.w3.org/1999/xlink">not having We propose structure called EGH filter supports operations, besides, it guarantee free operations finite universe restricted number elements stored filter. refer limited size zone describe necessary conditions false-positive then generalize listing through use counters rather than bits. detail applications discuss potential generalizations. evaluate performance comparison traditional filters. also price terms memory needs paid real positive-free having deterministic filter-like behavior. Our based on recently developed combinatorial group testing techniques.